- bounded size
- Математика: конечный размер (http://www.izvestia.komisc.ru/Archive/i04/sekushin.pdf)
Универсальный англо-русский словарь. Академик.ру. 2011.
bounded size
Смотреть что такое "bounded size" в других словарях:
Size Strength classification — is a two parameter rock classification based on the strength of intact rock and the spacing of discontinuities in the rock mass. It was developed by Louis and Franklin (1970 75). The size strength approach to rock mass characterisation has been… … Wikipedia
Bounded set — In mathematical analysis and related areas of mathematics, a set is called bounded, if it is, in a certain sense, of finite size. Conversely a set which is not bounded is called unbounded. Definition A set S of real numbers is called bounded from … Wikipedia
Bounded variation — In mathematical analysis, a function of bounded variation refers to a real valued function whose total variation is bounded (finite): the graph of a function having this property is well behaved in a precise sense. For a continuous function of a… … Wikipedia
Totally bounded space — In topology and related branches of mathematics, a totally bounded space is a space that can be covered by finitely many subsets of any fixed size (where the meaning of size depends on the given context). The smaller the size fixed, the more… … Wikipedia
Resource bounded measure — Lutz s resource bounded measure is a generalisation of Lebesgue measure to complexity classes. It was originally developed by Jack Lutz. Just as Lebesgue measure gives a method to quantify the size of subsets of the Euclidean space R^n, resource… … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Dynamic array — Several values are inserted at the end of a dynamic array using geometric expansion. Grey cells indicate space reserved for expansion. Most insertions are fast (constant time), while some are slow due to the need for reallocation (Θ(n) time,… … Wikipedia
Independent set (graph theory) — The nine blue vertices form a maximum independent set for the Generalized Petersen graph GP(12,4). In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent. That is, it is a set I of vertices … Wikipedia
Divide and conquer algorithm — In computer science, divide and conquer (D C) is an important algorithm design paradigm based on multi branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub problems of the same (or… … Wikipedia
Gossip protocol — A gossip protocol is a style of computer to computer communication protocol inspired by the form of gossip seen in social networks. Modern distributed systems often use gossip protocols to solve problems that might be difficult to solve in other… … Wikipedia
Random regular graph — A random d regular graph is a graph from mathcal{G} {n,d}, which denotes the probability space of all d regular graphs on vertex set [n] , where nd is even and [n] :={1,2,3,...,n 1,n}, with uniform distribution. Pairing ModelPairing Model, also… … Wikipedia
